def solve():
size = int(input())
oggy_house = [[0] * size for _ in range(size)]
rick = 0
morty = 0
for ben in range(1, 2 * size + 1):
if ben & 1:
gwen = size
for j in range(size):
oggy_house[rick][j] = gwen
gwen -= 1
rick += 1
else:
gwen = size
for i in range(size):
oggy_house[i][morty] = gwen
gwen -= 1
morty += 1
total_sum = sum(sum(row) for row in oggy_house)
print(total_sum, 2 * size)
phineas = 1
ferb = 1
ans = list(range(size, 0, -1))
for ben in range(1, 2 * size + 1):
if ben & 1:
print(1, phineas, *ans)
phineas += 1
else:
print(2, ferb, *ans)
ferb += 1
tc = int(input())
for _ in range(tc):
solve()
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |